Random Deletion in a Scale-Free Random Graph Process
نویسندگان
چکیده
منابع مشابه
Random Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and deletes vertices randomly. At time t, with probability α1 > 0 we add a new vertex ut and m random edges incident with ut. The neighbours of ut are chosen with probability proportional to degree. With probability α − α1 ≥ 0 we add m random edges to existing vertices where the endpoints ar...
متن کاملDegree-correlation of a Scale-free Random Graph Process
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process: one node is added at a time and is connected to an earlier node chosen with probability proportional to its degree. A recent empirical study of Newman [5] demonstrates existence of degree-correlation between degrees of adjacent nodes in real-world networks. Here we define the degree correlation...
متن کاملThe degree sequence of a scale-free random graph process
Recently, Barabási and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In [2] and, with Jeong, in [3], Barabási and Albert suggested that after many step...
متن کاملWeighted Scale-Free Random Graph Model
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of three generic mechanisms: (i) networks expand continuously by attaching addition of new vertices, (ii) new vertex wit...
متن کاملThe clustering coefficient of a scale-free random graph
We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the clustering coefficient of the graph process is asymptotically proportional to log n n . Bollobás and Riordan [3] have previously shown that when the constant is z...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2004
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2004.10129095